The induced path convexity, betweenness, and svelte graphs

نویسندگان

  • Aurora Morgana
  • Henry Martyn Mulder
چکیده

The induced path interval J (u; v) consists of the vertices on the induced paths between u and v in a connected graph G. Di-erences in properties with the geodesic interval are studied. Those graphs are characterized, in which the induced path intervals de/ne a proper betweenness. The intersection of the induced path intervals between the pairs of a triple, in general, consists of a big chunk of vertices. The graphs, in which this intersection consists of at most one vertex, for each triple of vertices, are characterized by forbidden subgraphs. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On convexity in complex networks

Lovro Šubelj University of Ljubljana, Faculty of Computer and Information Science Ljubljana, Slovenia [email protected] Tilen Marc Institute of Mathematics, Physics and Mechanics Ljubljana, Slovenia [email protected] Metric graph theory is a study of geometric properties of graphs based on a notion of the shortest path between the nodes defined as the path through the smallest number ...

متن کامل

Triangle path transit functions, betweenness and pseudo-modular graphs

The geodesic and induced path transit functions are the two well-studied interval functions in graphs. Two important transit functions related to the geodesic and induced path functions are the triangle path transit functions which consist of all vertices on all u, v-shortest (induced) paths or all vertices adjacent to two adjacent vertices on all u, v-shortest (induced) paths, for any two vert...

متن کامل

Convex Sets in Lexicographic Products of Graphs

Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies [4, Theorem 3.1].

متن کامل

On monophonic sets in graphs1

Classical convexity can be naturally translated to graphs considering shortest paths, giving rise to the geodesic convexity. Moreover, if we consider induced paths between vertices, we get the so-called monophonic convexity. In this work, we present some results involving monophonic sets.

متن کامل

The Induced Path Transit Function and the Pasch Axiom

The Pasch axiom is a strong geometric property which was noted and discussed even from the period of Euclid. Modern geometers followed the study of the Pasch axiom and in the context of axiomatic convexity this axiom was widely studied by pioneers in convexity theory. The connected graphs G for which the geodesic interval function I satisfies the Pasch axiom were characterized by Chepoi in 1994...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 254  شماره 

صفحات  -

تاریخ انتشار 2002